Search results for "discrete [space-time]"
showing 10 items of 2035 documents
On the Ball-Marsden-Slemrod obstruction for bilinear control systems
2019
International audience; In this paper we present an extension to the case of $L^1$-controls of a famous result by Ball--Marsden--Slemrod on the obstruction to the controllability of bilinear control systems in infinite dimensional spaces.
On Strong Convergence of Halpern’s Method for Quasi-Nonexpansive Mappings in Hilbert Spaces
2016
In this paper, we introduce a Halpern’s type method to approximate common fixed points of a nonexpansive mapping T and a strongly quasi-nonexpansive mappings S, defined in a Hilbert space, such that I − S is demiclosed at 0. The result shows as the same algorithm converges to different points, depending on the assumptions of the coefficients. Moreover, a numerical example of our iterative scheme is given.
Anti-concentration property for random digraphs and invertibility of their adjacency matrices
2016
Let Dn,dDn,d be the set of all directed d-regular graphs on n vertices. Let G be a graph chosen uniformly at random from Dn,dDn,d and M be its adjacency matrix. We show that M is invertible with probability at least View the MathML source1−Cln3d/d for C≤d≤cn/ln2nC≤d≤cn/ln2n, where c,Cc,C are positive absolute constants. To this end, we establish a few properties of directed d-regular graphs. One of them, a Littlewood–Offord-type anti-concentration property, is of independent interest: let J be a subset of vertices of G with |J|≤cn/d|J|≤cn/d. Let δiδi be the indicator of the event that the vertex i is connected to J and δ=(δ1,δ2,…,δn)∈{0,1}nδ=(δ1,δ2,…,δn)∈{0,1}n. Then δ is not concentrate…
118 and Counting … The Periodic Table on its 150th Anniversary.
2019
"Is there still room for more elements in the modern periodic table with its currently 118 elements? Will we need another extra series in the periodic table besides the classical s-, p-, and d-block, and the lanthanides/actinides? Will the periodic table in this region still feature periodicity? …" Read more in the Guest Editorial by C. E. Dullmann.
Hierarchies of probabilistic and team FIN-learning
2001
AbstractA FIN-learning machine M receives successive values of the function f it is learning and at some moment outputs a conjecture which should be a correct index of f. FIN learning has two extensions: (1) If M flips fair coins and learns a function with certain probability p, we have FIN〈p〉-learning. (2) When n machines simultaneously try to learn the same function f and at least k of these machines output correct indices of f, we have learning by a [k,n]FIN team. Sometimes a team or a probabilistic learner can simulate another one, if their probabilities p1,p2 (or team success ratios k1/n1,k2/n2) are close enough (Daley et al., in: Valiant, Waranth (Eds.), Proc. 5th Annual Workshop on C…
Information potential for some probability density functions
2021
Abstract This paper is related to the information theoretic learning methodology, whose goal is to quantify global scalar descriptors (e.g., entropy) of a given probability density function (PDF). In this context, the core concept is the information potential (IP) S [ s ] ( x ) : = ∫ R p s ( t , x ) d t , s > 0 of a PDF p(t, x) depending on a parameter x; it is naturally related to the Renyi and Tsallis entropies. We present several such PDF, viewed also as kernels of integral operators, for which a precise relation exists between S[2](x) and the variance Var[p(t, x)]. For these PDF we determine explicitly the IP and the Shannon entropy. As an application to Information Theoretic Learning w…
Adjacent vertices can be hard to find by quantum walks
2018
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search by quantum walks on general graphs and show a wide class of configurations of marked vertices, for which search by quantum walk needs Ω(N) steps, that is, it has no speed-up over the classical exhaustive search. The demonstrated configurations occur for certain placements of two or more adjace…
Aggregation of Risk Level Assessments Based on Fuzzy Equivalence Relation
2017
The paper deals with the problem of aggregation of risk level assessments. We describe the technique of a risk level evaluation taking into account values of the risk level obtained for objects which are in some sense equivalent. For this purpose we propose to use the construction of a general aggregation operator based on the corresponding fuzzy equivalence relation. Numerical example of the investment risk level aggregation using an equivalence relation obtained on the basis of different macroeconomic factors for countries of one region is considered.
From fuzzy metric spaces to modular metric spaces: a fixed point approach
2017
We propose an intuitive theorem which uses some concepts of auxiliary functions for establishing existence and uniqueness of the fixed point of a self-mapping. First we work in the setting of fuzzy metric spaces in the sense of George and Veeramani, then we deduce some consequences in modular metric spaces. Finally, a sample homotopy result is derived making use of the main theorem.
An exact method for graph coloring
2006
International audience; We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.